The Symmetric and Antisymmetric Eigenvalue Problem for Electromagnetic Equilateral Triangular Waveguides via Plane Wave Reconstruction
نویسندگان
چکیده
منابع مشابه
Discontinuous Plane Rotations and the Symmetric Eigenvalue Problem
Elementary plane rotations are one of the building blocks of numerical linear algebra and are employed in reducing matrices to condensed form for eigenvalue computations and during the QR algorithm. Unfortunately, their implementation in standard packages such as EISPACK, the BLAS and LAPACK lack the continuity of their mathematical formulation, which makes results from software that use them s...
متن کاملSymmetric and antisymmetric modes of electromagnetic resonators
In this paper, we numerically study a new type of infrared resonator structure, whose unit cell consists of paired split-ring resonators (SRRs). At different resonant frequencies, the magnetic dipoles induced from the two SRRs within one unit cell can be parallel or antiparallel, which are defined as symmetric and antisymmetic modes, respectively. Detailed simulation indicates that the symmetri...
متن کاملSome results on the symmetric doubly stochastic inverse eigenvalue problem
The symmetric doubly stochastic inverse eigenvalue problem (hereafter SDIEP) is to determine the necessary and sufficient conditions for an $n$-tuple $sigma=(1,lambda_{2},lambda_{3},ldots,lambda_{n})in mathbb{R}^{n}$ with $|lambda_{i}|leq 1,~i=1,2,ldots,n$, to be the spectrum of an $ntimes n$ symmetric doubly stochastic matrix $A$. If there exists an $ntimes n$ symmetric doubly stochastic ...
متن کاملThe symmetric eigenvalue complementarity problem
In this paper the Eigenvalue Complementarity Problem (EiCP) with real symmetric matrices is addressed. It is shown that the symmetric (EiCP) is equivalent to finding an equilibrium solution of a differentiable optimization problem in a compact set. A necessary and sufficient condition for solvability is obtained which, when verified, gives a convenient starting point for any gradient-ascent loc...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings
سال: 2018
ISSN: 2504-3900
DOI: 10.3390/proceedings2010013